A Generalized Inverse Iteration for Computing Simple Eigenvalues of Nonsymmetric Matrices
نویسندگان
چکیده
Technische Universit at Dresden Herausgeber: Der Rektor A Generalized Inverse Iteration for Computing Simple Eigenvalues of Nonsymmetric Matrices Hubert Schwetlick and Ralf L osche IOKOMO-07-97 December 1997 Preprint-Reihe IOKOMO der DFG-Forschergruppe Identi kation und Optimierung komplexer Modelle auf der Basis analytischer Sensitivitatsberechnungen an der Technischen Universitat Dresden Sprecher: Andreas Griewank, Institut f ur Wissenschaftliches Rechnen ∂ I W R NM
منابع مشابه
A mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملA New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملThe preconditioned inverse iteration for hierarchical matrices
The preconditioned inverse iteration [Ney01a] is an efficient method to compute the smallest eigenpair of a symmetric positive definite matrix M . Here we use this method to find the smallest eigenvalues of a hierarchical matrix [Hac99]. The storage complexity of the datasparse H-matrices is almost linear. We use H-arithmetic to precondition with an approximate inverse of M or an approximate Ch...
متن کاملA STABLE COUPLED NEWTON'S ITERATION FOR THE MATRIX INVERSE $P$-TH ROOT
The computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. It is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of New-ton's method, but previous researchers have mentioned that some iter...
متن کامل